Circuit Complexity of Shuffle
نویسنده
چکیده
We show that Shuffle(x, y, w), the problem of determining whether a string w can be composed from an order preserving shuffle of strings x and y, is not in AC, but it is in AC. The fact that shuffle is not in AC is shown by a reduction of parity to shuffle and invoking the seminal result [FSS84], while the fact that it is in AC is implicit in the results of [Man82a]. Together, the two results provide a strong complexity bound for this combinatorial problem.
منابع مشابه
Verifiable Shuffle of Large Size Ciphertexts
A shuffle is a permutation and rerandomization of a set of ciphertexts. Among other things, it can be used to construct mix-nets that are used in anonymization protocols and voting schemes. While shuffling is easy, it is hard for an outsider to verify that a shuffle has been performed correctly. We suggest two efficient honest verifier zero-knowledge (HVZK) arguments for correctness of a shuffl...
متن کاملSub-linear Zero-Knowledge Argument for Correctness of a Shuffle
A shuffle of a set of ciphertexts is a new set of ciphertexts with the same plaintexts in permuted order. Shuffles of homomorphic encryptions are a key component in mix-nets, which in turn are used in protocols for anonymization and voting. Since the plaintexts are encrypted it is not directly verifiable whether a shuffle is correct, and it is often necessary to prove the correctness of a shuff...
متن کاملSoluble Expression and Purification of Q59L Mutant L-asparaginase in the Presence of Chaperones in SHuffle™ T7 strain
Background and Aims: Q59L mutant of L-asparaginase enzyme from Escherichia coli (E. coli) has been introduced with lower side effects. This version of the enzyme might have potential applications in the treatment of leukemia patients. We utilized SHuffle T7 strain of E. coli, to produce the mutant enzyme in the presence of chaperone molecules. Materials and Methods: Q59LAsp gene was cloned in...
متن کاملA Public Shuffle without Private Permutations
In TCC 2007, Adida and Wikström proposed a novel approach to shuffle, called a public shuffle, in which a shuffler can perform shuffle publicly without needing information kept secret. Their scheme uses an encrypted permutation matrix to shuffle ciphertexts publicly. This approach significantly reduces the cost of constructing a mix-net to verifiable joint decryption. Though their method is suc...
متن کاملA Micropower Current-Mode Euclidean Distance Calculator for Pattern Recognition
In this paper a new synthesis for circuit design of Euclidean distance calculation is presented. The circuit is implemented based on a simple two-quadrant squarer/divider block. The circuit that employs floating gate MOS (FG-MOS) transistors operating in weak inversion region, features low circuit complexity, low power (<20uW), low supply voltage (0.5V), two quadrant input current, wide dyn...
متن کامل